Axiomatic inscriptional syntax. Part II. The syntax of protothetic.
نویسندگان
چکیده
منابع مشابه
Axiomatic Truth, Syntax and Metatheoretic Reasoning
Richard Heck in [2] and Volker Halbach in [1] have recently manifested much interest in an unconventional way of constructing (axiomatic) theories of truth, in which syntactic and logical notions concerning the object theory O are formalised in a disjoint theory of syntax S. In the talk, I shall first argue for the proposed alternative. I will then present the theory CTD[O], standing for compos...
متن کاملHeaded relative clauses in generative syntax – Part II
3. The modification problem In the first part of this State-of-the-Article I discussed the connectivity problem, namely, the syntactic relation between the relative ‘‘head’’ and the relativization site. The second general issue that I will be discussing here is the way in which the whole relative clause is syntactically related to the modified ‘‘head’’. As a preliminary, it is necessary to dete...
متن کاملA syntax-based part-of-speech analyser
There are two main methodologies for constructing the knowledge base of a natural language analyser: the linguistic and the data-driven. Recent state-ofthe-art part-of-speech taggers are based on the data-driven approach. Because of the known feasibility of the linguistic rule-based approach at related levels of description, the success of the datadriven approach in part-of-speech analysis may ...
متن کاملSyntax
Syntax is the cognitive capacity of human beings that allows us to connect linguistic meaning with linguistic form. The study of syntax is a huge field that has generated a great deal of empirical and theoretical work over the decades. This article outlines why understanding our syntactic capacity is important to cognitive science in general and why the data of syntactic research is to be taken...
متن کاملThe logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a,A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at the construction of a complete predicate logic for prelinear tied adjointness algebras. We realize this in three steps. In the first step, we establish a propositional calculus AdjTPC, complete for the class of all tied a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1973
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093890806